Two-Dimensional Orthonormal Tree-Structured Haar Transform for Fast Block Matching
نویسندگان
چکیده
منابع مشابه
A Block-Grouping Method for Image Denoising by Block Matching and 3-D Transform Filtering
Image denoising by block matching and threedimensionaltransform filtering (BM3D) is a two steps state-ofthe-art algorithm that uses the redundancy of similar blocks innoisy image for removing noise. Similar blocks which can havesome overlap are found by a block matching method and groupedto make 3-D blocks for 3-D transform filtering. In this paper wepropose a new block grouping algorithm in th...
متن کاملFast Discrete Orthonormal Stockwell Transform
We present an efficient method for computing the discrete orthonormal Stockwell transform (DOST). The Stockwell transform (ST) is a time-frequency decomposition transform that is showing great promise in various applications, but is limited because its computation is infeasible for most applications. The DOST is a nonredundant version of the ST, solving many of the memory and computational issu...
متن کاملFast Two-Dimensional Pattern Matching
An algorithm for searching for a two dimensional m m pattern in a two dimensional n n text is presented. It performs on the average less comparisons than the size of the text: n 2 =m using m 2 extra space. Basically, it uses multiple string matching on only n=m rows of the text. It runs in at most 2n 2 time and is close to the optimal n 2 time for many patterns. It steadily extends to an alphab...
متن کاملPruning the Two-Dimensional Fast Cosine Transform
Two pruning algorithms for the Vector-Radix Fast Cosine Transform are presented. Both are based on an in-place approach of the direct two-dimensional fast cosine transform (2D FCT). The first pruning algorithm concerns the computation of N0xN0 out of NxN DCT points, where both N0 and N are powers of 2. The second pruning algorithm is more general and concerns a recursive approach for the comput...
متن کاملA commutative digital image watermarking and encryption method in the tree structured Haar transform domain
In this paper a commutative watermarking and ciphering scheme for digital images is presented. The commutative property of the proposed method allows to cipher a watermarked image without interfering with the embedded signal or to watermark an encrypted image still allowing a perfect deciphering. Both operations are performed on a parametric transform domain: the Tree Structured Haar transform....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Imaging
سال: 2018
ISSN: 2313-433X
DOI: 10.3390/jimaging4110131